On the Connections between Rewriting and Formal Language Theory
Identifieur interne : 00A957 ( Main/Exploration ); précédent : 00A956; suivant : 00A958On the Connections between Rewriting and Formal Language Theory
Auteurs : Friedrich Otto [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Formal language theory, and in particular the theory of automata, has provided many tools that have been found extremely useful in rewriting theory, since automata can be used for deciding certain properties of rewriting systems as well as for constructing (weakly) confluent rewriting systems. On the other hand, rewriting theory has had some influence on the development of formal language theory, since based on certain rewriting systems some interesting classes of formal languages have been defined. Here a survey on some connections between rewriting and formal language theory is given, starting from the classical string languages and string-rewriting systems and continuing with tree automata and term-rewriting systems.
Url:
DOI: 10.1007/3-540-48685-2_27
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000255
- to stream Istex, to step Curation: 000254
- to stream Istex, to step Checkpoint: 002343
- to stream Main, to step Merge: 00B009
- to stream Main, to step Curation: 00A957
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On the Connections between Rewriting and Formal Language Theory</title><author><name sortKey="Otto, Friedrich" sort="Otto, Friedrich" uniqKey="Otto F" first="Friedrich" last="Otto">Friedrich Otto</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:0BCA9CDAF7037B87B4BA8E0C410C3E6522D44B83</idno><date when="1999" year="1999">1999</date><idno type="doi">10.1007/3-540-48685-2_27</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-Z1WDJT3N-G/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000255</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000255</idno><idno type="wicri:Area/Istex/Curation">000254</idno><idno type="wicri:Area/Istex/Checkpoint">002343</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002343</idno><idno type="wicri:doubleKey">0302-9743:1999:Otto F:on:the:connections</idno><idno type="wicri:Area/Main/Merge">00B009</idno><idno type="wicri:Area/Main/Curation">00A957</idno><idno type="wicri:Area/Main/Exploration">00A957</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On the Connections between Rewriting and Formal Language Theory</title><author><name sortKey="Otto, Friedrich" sort="Otto, Friedrich" uniqKey="Otto F" first="Friedrich" last="Otto">Friedrich Otto</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich Mathematik/Informatik, Universität Kassel, D–34109, Kassel</wicri:regionArea><placeName><region type="land" nuts="1">Hesse (Land)</region><region type="district" nuts="2">District de Kassel</region><settlement type="city">Cassel (Hesse)</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Formal language theory, and in particular the theory of automata, has provided many tools that have been found extremely useful in rewriting theory, since automata can be used for deciding certain properties of rewriting systems as well as for constructing (weakly) confluent rewriting systems. On the other hand, rewriting theory has had some influence on the development of formal language theory, since based on certain rewriting systems some interesting classes of formal languages have been defined. Here a survey on some connections between rewriting and formal language theory is given, starting from the classical string languages and string-rewriting systems and continuing with tree automata and term-rewriting systems.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>District de Kassel</li><li>Hesse (Land)</li></region><settlement><li>Cassel (Hesse)</li></settlement></list><tree><country name="Allemagne"><region name="Hesse (Land)"><name sortKey="Otto, Friedrich" sort="Otto, Friedrich" uniqKey="Otto F" first="Friedrich" last="Otto">Friedrich Otto</name></region><name sortKey="Otto, Friedrich" sort="Otto, Friedrich" uniqKey="Otto F" first="Friedrich" last="Otto">Friedrich Otto</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00A957 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00A957 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:0BCA9CDAF7037B87B4BA8E0C410C3E6522D44B83
|texte= On the Connections between Rewriting and Formal Language Theory
}}
| This area was generated with Dilib version V0.6.33. |  |